Geometrical semantics for linear logic (multiplicative fragment)
نویسندگان
چکیده
منابع مشابه
Proof Diagrams for Multiplicative Linear Logic: Syntax and Semantics
Proof nets are a syntax for linear logic proofs which gives a coarser notion of proof equivalence with respect to syntactic equality together with an intuitive geometrical representation of proofs. In this paper we give an alternative 2-dimensional syntax for multiplicative linear logic derivations. The syntax of string diagrams authorizes the definition of a framework where the sequentializabi...
متن کاملRelational semantics for a fragment of linear logic
Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic. In [4] it is shown that the theory of relational semantics is also available in the more general setting of substructural logic, at least in an algebraic guise. Building on these ideas, in [5] a type of frames is described which generalize Kripke frames and provide semantics for ...
متن کاملA Simplified Semantics for a Fragment of Intuitionistic Linear Logic
We introduce a simplified Kripke type semantics for the {→,∧, ∗, !,1}-fragment of intuitionistic linear logic, and prove a completeness theorem with respect to the semantics by using a simple and intuitive canonical model.
متن کاملFixpoint Semantics for a Fragment of First-Order Linear Logic
In this paper we investigate the theoretical foundation of a bottom-up, xpoint semantics for a subset of Girard's linear logic [Gir87]. More precisely, we consider a rst-order formulation of a fragment of LinLog [And92] including multiplicative disjunction and universal quanti cation over goals. The semantics is de ned by means of a xpoint operator which is monotonic and continuous over an exte...
متن کاملProofs, denotational semantics and observational equivalences in Multiplicative Linear Logic
We study full completeness and syntactical separability of MLL proof nets with the mix rule. The general method we use consists first in addressing the two questions in the less restrictive framework of proof structures, and then in adapting the results to proof nets. At the level of proof structures, we find a semantical characterization of their interpretations in relational semantics, and we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.03.020